Digital Circuit Layout based on Graph Partitioning Technique using DNA Computing
نویسندگان
چکیده
After Adleman and Lipton have described the potential power of DNA computing, researchers have developed an interest in DNA computing for solving difficult computational problems like NP-complete problems. Partitioning of digital circuits also come under this category. Partitioning plays a key role in the design of a computer system. Existing conventional methods are unable to achieve the required breakthrough in terms of complexity, time and cost. This paper discusses how the potential of DNA can be used to solve the instances of circuit partitioning problem in an efficient way. A prototypical algorithm named DBACP is developed for solving the partitioning problem which is compared with SCAP approach on the small scale instances of circuit Benchmarks.
منابع مشابه
Fault Tolerant DNA Computing Based on Digital Microfluidic Biochips
Historically, DNA molecules have been known as the building blocks of life, later on in 1994, Leonard Adelman introduced a technique to utilize DNA molecules for a new kind of computation. According to the massive parallelism, huge storage capacity and the ability of using the DNA molecules inside the living tissue, this type of computation is applied in many application areas such as me...
متن کاملSoft Computing Approach for digital Circuit Layout based on Graph Partitioning
Soft computing based approaches are increasingly being used to solve different NP complete problems, the development of efficient parallel algorithms for digital circuit partitioning, circuit testing, logic minimization and simulation etc. is currently a field of increasing research activity. This paper describes evolutionary based approach for solving circuitpartitioning problem. That implies ...
متن کاملOn solving Mincut Balanced Circuit Partitioning Problem for Digital Circuit Layout using Evolutionary Approach with Solution Archive
The interest in finding an optimal partition in the area of VLSI has been a hot issue in recent years. Circuit Partitioning Problem is one of the most studied NP complete problems notable for its broad spectrum of applicability in digital circuit layout. The balanced constraint is an important constraint that obtains an area balanced layout without compromising the mincut objective. This paper ...
متن کاملRecent Trends in Graph Partitioning for Scienti c Computing
Graph partitioning is a widespread technique in computer science, scienti c computing, and related elds. The most common formulation of the graph partitioning problem (GPP) for an undirected graph G = (V,E) asks for a division of V into k pairwise disjoint subsets (parts) with size approximately |V|/k such that the edge cut, i.e., the total number of edges having their incident nodes in di eren...
متن کاملAn Algorithm for Min Cut Partitioning for Digital Circuit Layout based on Evolutionary Approach
The paper presents a new algorithm for circuit partitioning that exploits some of the latest innovations of evolutionary approaches. The proposed algorithm based on swarm intelligence technique hybrids discrete version of artificial bee colony algorithm with Inver over operator along with simulated annealing technique for local improvement of solution. The algorithm is tested on small UCLA inst...
متن کامل